Technical Note—A Note on the Multiple Traveling Salesmen Problem
نویسندگان
چکیده
منابع مشابه
A Market-based Solution to the Multiple Traveling Salesmen Problem
This paper describes a market-based solution to the problem of assigning mobile agents to tasks. The problem is formulated as the multiple depots, multiple traveling salesmen problem (MTSP), where agents and tasks operate in a market to achieve near-optimal solutions. We consider both the classical MTSP, in which the sum of all tour lengths is minimized, and the Min-Max MTSP, in which the longe...
متن کاملThe multiple traveling salesmen problem with moving targets
The multiple traveling salesmen problem with moving targets (MTSPMT) is a generalization of the classical traveling salesmen problem (TSP), where the targets (cities or objects) are moving over time. Additionally, for each target a visibility time window is given. The task is to find routes for several salesmen so that each target is reached exactly once within its visibility time window and th...
متن کاملComparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm
Abstract: Multiple traveling salesman problems (MTSP) are a typical computationally complex combinatorial optimization problem, which is an extension of the famous traveling salesman problem (TSP). The MTSP can be generalized to a wide variety of routing and scheduling problems. The paper makes the attempt to show how Genetic Algorithm (GA) can be applied to the MTSP with ability constraint. In...
متن کاملMultiple Traveling Salesmen in Asymmetric Metrics
We consider some generalizations of the Asymmetric Traveling Salesman Path problem. Suppose we have an asymmetric metric G = (V,A) with two distinguished nodes s, t ∈ V . We are also given a positive integer k. The goal is to find k paths of minimum total cost from s to t whose union spans all nodes. We call this the k-Person Asymmetric Traveling Salesmen Path problem (k-ATSPP). Our main result...
متن کاملLearning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks
While there are optimal TSP solvers as well as recent learning-based approaches, the generalization of the TSP to the multiple Traveling Salesmen Problem is much less studied. Here, we design a neural network solution that treats the salesmen, the cities, and the depot as three different sets of varying cardinalities. Coupled with a normalization algorithm, a dedicated loss, and a search method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1980
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.28.3.628